Part-level Sequence Dependent Setup Time Reduction in CMS

نویسندگان

  • Nadia Bhuiyan Department of Mechanical and Industrial Engineering, Concordia University, Quebec, Canada
  • Shahram Sharifi Department of Mechanical and Industrial Engineering, Concordia University, Quebec, Canada
  • Stayaveer.S. Chauhan John Molson School of Business, Concordia University, Quebec, Canada
چکیده مقاله:

This paper presents the idea of creating cells while reducing part-level sequence-dependent setup time in general cellular manufacturing systems (CMS). Setup time reduction in CMS has gained modest attention in the literature. This could be attributed to the fact that the fundamental problem in cell formation in CMS has been mainly related to material handling and machine utilization while setup time was assumed to implicitly decrease as a result of grouping similar parts in a manufacturing cell. Despite more than three decades of CMS’s history, it has been relatively recent that setup time has been included in cell formation problems and found a place in the existing models. However, sequence-dependent setup time in the literature has been dealt with mostly within the context of scheduling “part-families” in a single manufacturing cell or in the allocation of parts to flow line cells. The present model includes the three fundamental elements of a cell formation procedure: machine utilization, intercellular movement and setup time. This therefore provides a basic structure that would serve as a general sub-model for real manufacturing cell formation problems including any type of setup time and manufacturing cell. Due to computation time and complexity of the problem, a solution approach based on theGenetic Algorithm based (GA-based)heuristic has been discussed and the solution of a sample problem has been compared with that of conventional optimization software. The results indicate a reasonably satisfactory performance by the GAbased heuristic in terms of accuracy and computation time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

متن کامل

An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

an iterated greedy algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion time

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

متن کامل

Flowshop Schedules with Sequence Dependent Setup Times

The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 5  شماره 3

صفحات  142- 153

تاریخ انتشار 2011-10-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023